Computation of median orders: complexity results
نویسنده
چکیده
Given a set of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizing the number of disagreements with respect to the given set and verifying some structural properties like transitivity. We study the complexity of this problem when the individual preferences as well as the collective one must verify different properties, and we show that the aggregation problem is NP-hard for different types of collective preferences, even when the individual preferences are linear orders.
منابع مشابه
Median orders of tournaments: a tool for the second neighbourhood problem and Sumner’s conjecture
We give a short constructive proof of a theorem of Fisher: every tournament contains a vertex whose second outneighbourhood is as large as its first outneighbourhood. Moreover, we exhibit two such vertices provided that the tournament has no dominated vertex. The proof makes use of median orders. A second application of median orders is that every tournament of order 2n − 2 contains every arbor...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملUsing median sets for inferring phylogenetic trees
MOTIVATION Algorithms for phylogenetic tree reconstruction based on gene order data typically repeatedly solve instances of the reversal median problem (RMP) which is to find for three given gene orders a fourth gene order (called median) with a minimal sum of reversal distances. All existing algorithms of this type consider only one median for each RMP instance even when a large number of medi...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملRepresentation of an Order as Union ofInterval
We present a practical method to obtain a compact computer memory representation of orders and to compute pairwise comparisons eeciently. The principle of this method is to represent an order P as a union of interval orders Pi for which an optimal representation is already known (i.e. a union representation of P Wes85]). For a directed acyclic graph G = (X; U) representing an order P = (X; <P),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004